Directions in Polynomial Reconstruction Based Cryptography
نویسنده
چکیده
. In ACM, editor, Proceedings of the thirty-first annual ACM Symposium on Theory of Computing: Atlanta, Georgia, May 1–4, 1999, pages 537–546, New York, NY, USA, 1999. ACM Press. Aggelos Kiayias is currently an Assistant Professor of Computer Science and Engineering at the University of Con-necticut. He holds a PhD and MA from the City University of New York and his main research area is Cryptography. Dr. Kiayias is a Fulbright fellow and he was a Tutorial Speaker at the 2002 ACM Conference on Computer and Communica-tions Security on the subject of Electronic Voting. Dr. Kiayias is a graduate of the Mathematics Department of the University of Athens, Greece. Moti Yung received his B.Sc. andM.Sc. in Mathematics from Tel-Aviv University in 1978 and 1982 respectively. He got an M. Phil. and Ph.D. in Com-puter Science from Columbia University in 1987. Dr. Yung has over 25 years of experience in Computer Science and In-formation Technology (in research as well as in design, development, education and executive management). He is currentlya Senior Research Scientist Professor at Columbia University and an Independent Consultant. Previously he was the Chief Scientist and Vice President of CertcoInc. working in cryptographic technology, PKI, security and electronic commerce. He was with IBM research division from 1988 till 1996 where he received IBM’s outstanding innovation awardfor his research contributions leading to products. Dr. Yung has published extensively in Cryptography, Information Security and Foundations of Computer Science. He is an editor of the Jour-nal of Cryptology and the International Journal on Information Security and served as Crypto 2002 program chair.
منابع مشابه
EEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملPolynomial Reconstruction Based Cryptography (A Short Survey)
Cryptography and Coding Theory are closely knitted in many respects. Recently, the problem of Decoding Reed Solomon Codes (aka Polynomial Reconstruction) was suggested as an intractability assumption upon which the security of cryptographic protocols can be based. This has initiated a line of research that exploited the rich algebraic structure of the problem and related subproblems of which in...
متن کاملA Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem
The Polynomial Reconstruction problem (PR) has been introduced in 1999 as a new hard problem. Several cryptographic primitives established on this problem have been constructed, for instance Naor and Pinkas have proposed a protocol for oblivious polynomial evaluation. Then it has been studied from the point of view of robustness, and several important properties have been discovered and proved ...
متن کاملDynamic threshold secret reconstruction and its application to the threshold cryptography
a r t i c l e i n f o a b s t r a c t Shamir's (t, n) secret sharing scheme (SS) is based on a univariate polynomial and is the most cited SS in the literature. The secret in a (t, n) SS can be recovered either by exactly t or more than t shareholders. Most SSs only consider when there are exactly t shareholders participated in the secret reconstruction. In this paper, we examine security issue...
متن کاملCryptanalysis of a Public-Key Encryption Scheme Based on the Polynomial Reconstruction Problem
We describe a cryptanalysis of a public-key encryption scheme based on the polynomial reconstruction problem, published at Eurocrypt 2003 by Augot and Finiasz. Given the public-key and a ciphertext, we recover the corresponding plaintext in polynomial time. Our technique is a variant of the Berlekamp-Welsh algorithm. We also describe a cryptanalysis of the reparation published by the authors on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006